MONOTONE CONVOLUTION AND MONOTONE INFINITE DIVISIBILITY FROM COMPLEX ANALYTIC VIEWPOINT
نویسندگان
چکیده
منابع مشابه
Lower bound for monotone Boolean convolution
Any monotone Boolean circuit computing the n-dimensional Boolean convolution requires at least n2 and-gates. This matches the obvious upper bound. The previous best bound for this problem was Ω(n4/3), obtained by Norbert Blum in 1981. More generally, exact bounds are given for all semi-disjoint bilinear forms.
متن کاملConvolution Equivalence and Infinite Divisibility: Corrections and Corollaries
Corrections are made to formulations and proofs of some theorems about convolution equivalence closure for random sum distributions. These arise because of the falsity of a much used asymptotic equivalence lemma, and they impinge on the convolution equivalence closure theorem for general infinitely divisible laws.
متن کاملMonotone and Near-Monotone Systems
This paper provides an expository introduction to monotone and nearmonotone biochemical network structures. Monotone systems respond in a predictable fashion to perturbations, and have very robust dynamical characteristics. This makes them reliable components of more complex networks, and suggests that natural biological systems may have evolved to be, if not monotone, at least close to monoton...
متن کاملMonotone Operations and Monotone Groups∗
We survey an algebraic approach to proving impossibility results in distributed computing. The approach is emerging around monotone groups, a new class of algebraic groups we define here as a tight suit to monotone Read&Modify&Write (or RMW) operations in a distributed system. The yields of this approach have been the first impossibility results for implementations of monotone RMW operations th...
متن کاملCumulants of a convolution and applications to monotone probability theory
In non-commutative probability theory, cumulants and their appropriate generating function are defined when a notion of independence is given [17, 18, 19]. They are useful especially in the central limit theorem and Poisson’s law of small numbers. We denote by any one of classical, free and boolean convolutions. We denote by Dλ the dilation operator defined by (Dλμ)(B) = μ(λ B) for any Borel se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Infinite Dimensional Analysis, Quantum Probability and Related Topics
سال: 2010
ISSN: 0219-0257,1793-6306
DOI: 10.1142/s0219025710003973